An analysis of reduced Hessian methods for constrained optimization
نویسندگان
چکیده
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملInexact-hessian-vector Products for Efficient Reduced-space Pde-constrained Optimization
We investigate reduced-space Newton-Krylov (NK) algorithms for engineering parameter optimization problems constrained by partial-differential equations. We review reduced-space and full-space optimization algorithms, and we show that the efficiency of the reduced-space strategy can be improved significantly with inexact-Hessianvector products computed using approximate second-order adjoints. R...
متن کاملOPTIMIZATION TECHNOLOGY CENTER Argonne National Laboratory and Northwestern University NUMERICAL EXPERIENCE WITH A REDUCED HESSIAN METHOD FOR LARGE SCALE CONSTRAINED OPTIMIZATION by
The reduced Hessian SQP algorithm presented in is developed in this paper into a practical method for large scale optimization The novelty of the algorithm lies in the incorporation of a correction vector that approximates the cross term ZWY pY This improves the stability and robustness of the algorithm without increasing its computational cost The paper studies how to implement the algorithm e...
متن کاملA numerical comparison of Hessian update techniques for an SQCQP method
This short note considers Hessian updates for a sequential quadratically constrained quadratic programming (SQCQP) method. The SQCQP method is an iterative method to solve an inequality constrained optimization problem. At each iteration, the SQCQP method solves a quadratically constrained quadratic programming subproblem whose objective function and constraints are approximations to the object...
متن کاملSNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. We discuss an SQP algorithm th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 49 شماره
صفحات -
تاریخ انتشار 1991